Abstraction and invariance for algebraically indexed types
نویسندگان
چکیده
منابع مشابه
Type-Indexed Data Types
A polytypic function is a function that can be instantiated on many data types to obtain data type speci c functionality. Examples of polytypic functions are the functions that can be derived in Haskell, such as show , read , and ( ). More advanced examples are functions for digital searching, pattern matching, uni cation, rewriting, and structure editing. For each of these problems, we not onl...
متن کاملStep-Indexed Syntactic Logical Relations for Recursive and Quantified Types
We present a proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a λ-calculus with recursive types and impredicative universal and existential types. We show that for recursive and polymorphic types, the method is both sound and complete with respect to contextual equivalence, while for existential types, it is sound but incomplete. Our de...
متن کاملIndexed Types in Object-Oriented Programming
Dependent type systems allow semantic properties to be expressed in types that carry important information about program values. The type systems in mainstream languages such as Java are effective but have a limited expressive power. We propose to extend a simple Java-like language with indexed types, a form of dependent types defined on index expressions that can statically detect many program...
متن کاملAn Extensible Theory of Indexed Types
Indexed families of types are a way of associating run-time data with compile-time abstractions that can be used to reason about them. We propose an extensible theory of indexed types, in which programmers can define the index data appropriate to their programs and use them to track properties of run-time code. The essential ingredients in our proposal are (1) a logical framework, which is used...
متن کاملCoherent Coercion Abstraction with a step-indexed strong-reduction semantics
The usual notion of type coercions that witness subtyping relations between types is generalized to a more expressive notion of typing coercions that witness subsumption relations between typings, e.g. pairs composed of a typing environment and a type. This is more expressive and allows for a clearer separation of language constructs with and without computational content. This is illustrated o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2013
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2480359.2429082